Discriminative MO-COP Operators

We address the problem of multi-objective constraint optimization problems (MO-COPs). Solving an MO-COP traditionally consists in computing the set of all Pareto solutions (i.e. the Pareto front). But this Pareto front is exponentially large in the general case. So this causes two main problems. First is the time complexity concerns. Second is a lack of decisiveness. In this paper, we present two classes of MO-COP operators that give preference to specific subsets of Pareto solutions and correspond to two classical doctrines in the community of Decision Theory: utilitarianism and egalitarianism. We provide a graphical characterization of these operators by giving a specific meaning of the resulting solutions in terms of a distance minimization between their utility vectors and a given utopia point.